Strong edge-coloring for planar graphs with large girth

A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. Let $G$ be a connected planar graph with girth $k\ge 26$ and maximum degree $\Delta$. We show that either $G$ is isomorphic to a subgraph of a very special $\Delta$-regular graph with girth $k$, or $G$ has a strong edge-coloring using at most $2\Delta +\lceil \frac{12(\Delta -2)}{k}\rceil$ colors.     

Optimal Planar Interception with Fixed End Conditions: Approximate Solutions

In a previous paper (Ref. 1), an exact solution of the optimal planar interception with fixed end conditions was derived in closed form. The optimal control was expressed as an explicit function of the state variables and two fixed parameters, obtained by solving a set of nonlinear algebraic equations involving elliptic integrals. In order to facilitate the optimal control implementation, the present paper derives a highly accurate simplified solution assuming that the ratio of the pursuer turning radius to the initial range is small. An asymptotic expansion further reduces the computational workload. Construction of a near-optimal open-loop control, based on the approximations, completes the present paper.     

Colloidal ZnO nanostructures and functional coatings: A survey

The past research work devoted to ZnO nanocolloidal sol-gel route is reviewed. It highlights the cluster chemistry of alcoholic ZnAc₂ solutions and the results of ZnO colloid growth investigations performed worldwide. Moreover, the role of doping and co-doping in the processing of functional ZnO coatings is discussed. The possibilities of tuning the optical properties are also reported with a particular attention to luminescence. The last part of this paper deals with electrical and photoelectrochemical properties of ZnO nanocrystals and their aggregates. This contribution is dedicated to the 80th birthday of Prof. Arnim Henglein from the Hahn-Meitner-Institut in Berlin and to the memory of Prof. Jacques Mugnier from the Université Claude-Bernard Lyon 1 in France.     

Proton conductivity of phosphoric acid derivative of fullerene

The proton conductive property of methano [60] fullerene diphosphoric acid has been investigated under various humidity conditions at the temperature range between 15 and 45 °C. It shows proton conductivity as high as 10⁻² S cm⁻¹ at 25 °C under relative humidity of 95%. Thermal analyses including TG–DTA and thermal desorption mass spectroscopy (TDS) confirm that the compound is thermally stable up to 200 °C. Proton conduction of the compound depends very much on humidity or water content. The logarithmic conductivity at 25 °C is increased linearly with increasing relative humidity. The activation energy (E_a) estimated from the slope of log(σT) vs. 1/T is decreased from 1.08 to 0.52 eV, as the relative humidity is increased from 40% to 75%. The humidity dependence of conductivity is discussed in the light of the observed hydration isotherm.     

Synthesis and chiroptical properties of two new planar-chiral macrocycles

Could simple intraannular-arm macrocyclic systems exist in enantiopure stable forms? The effective synthesis of two representative compounds of such a class, their resolution into enantiomers, and experiments justifying their stability toward racemization are presented.     

不良导体热系数和热体散热率测量方法研究(英文)

本文介绍一种直接测量散热率新方法．进而测出不良导体的热系数。该方法，减小了由间接测量散热率所带来的误差，实验装置简单，操作方便，参数少，测量结果的精确性和重复性都有较大提高，更重要的是这一新的实验方法突出了物理思想。     

NASICON型化合物结构的NMR研究

在水热晶化合成一系列NASICON型化合物的基础上,应用固体高分辨³¹P和²⁹Si MAS NMR,研究了几种NASICON化合物的结构,观察其骨架原子P和Si在结构中的状态及分布,并解释了由于在结构中发生取代作用而引起,Si或P的化学位移的变化.     

Drawing c-planar biconnected clustered graphs

In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon.     

Loss in a rectangular optical waveguide induced by the crossover of a second waveguide

We calculate the loss induced in a single-mode rectangular optical waveguide by the presence of a second waveguide, perpendicular to the first, which crosses over the first waveguide at a variable distance d. Our calculation is applied to the analysis of several doped silica waveguides of practical importance for optical circuit design.